Extreme Programming in a Resear hEnvironmentWilliam

Programming Resear h Group A GAME SEMANTICS FOR GENERIC POLYMORPHISM

Programming Resear h Group NOTE ON THE LOCATION OF OPTIMAL CLASSIFIERS IN N -DIMENSIONAL ROC SPACE

Programming Resear h Group REASONING ABOUT TEMPORAL CONSTRAINTS: CLASSIFYING THE COMPLEXITY IN ALLEN'S ALGEBRA BY USING AN ALGEBRAIC TECHNIQUE

FGP approach to multi objective quadratic fractional programming problem

Multi objective quadratic fractional programming (MOQFP) problem involves optimization of several objective functions in the form of a ratio of numerator and denominator functions which involve both contains linear and quadratic forms with the assumption that the set of feasible solutions is a convex polyhedral with a nite number of extreme points and the denominator part of each of the objecti...

A generalized super-efficiency model for ranking extreme efficient DMUs in stochastic DEA

In this current study a generalized super-efficiency model is first proposed for ranking extreme efficient decision making units (DMUs) in stochastic data envelopment analysis (DEA) and then, a deterministic (crisp) equivalent form of the stochastic generalized super-efficiency model is presented. It is shown that this deterministic model can be converted to a quadratic programming model. So fa...